منابع مشابه
Dijkstra Monads in Monadic Computation
The Dijkstra monad has been introduced recently for capturing weakest precondition computations within the context of program verification, supported by a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and pred...
متن کاملDijkstra and Hoare monads in monadic computation
The Dijkstra and Hoare monads have been introduced recently for capturing weakest precondition computations and computations with preand post-conditions, within the context of program verification, supported by a theorem prover. Here we give a more general description of such monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a trian...
متن کاملComputing the k Nearest-Neighbors for all Vertices via Dijkstra
We are given a directed graph G = (V,E) with n vertices and m edges, with positive weights on the edges, and a parameter k > 0. We show how to compute, for every vertex v ∈ V , its k nearest-neighbors. The algorithm runs in O(k(n log n + m)) time, and follows by a somewhat careful modification of Dijkstra’s shortest path algorithm. This result is probably folklore, but we were unable to find a ...
متن کاملSpeeding Up Dijkstra ’ s Algorithm for All Pairs Shortest Paths ∗
We present a technique for reducing the number of edge scans performed by Dijkstra’s algorithm for computing all pairs shortest paths. The main idea is to restrict path scanning only to locally shortest paths, i.e., paths whose proper subpaths are shortest paths. On a directed graph with n vertices and m edges, the technique we discuss allows it to reduce the number of edge scans from O(mn) to ...
متن کاملDijkstra Graphs
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquire a structure that is desirable in many aspects. While much has been written about structured programming, an important issue has been left unanswered: given an arbitrary, compiled program, describe an algorithm to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3341708